Counting characters in linear group actions
نویسندگان
چکیده
منابع مشابه
Counting characters in linear group actions
Let G be a finite group and V be a finite G–module. We present upper bounds for the cardinalities of certain subsets of Irr(GV ), such as the set of those χ ∈ Irr(GV ) such that, for a fixed v ∈ V , the restriction of χ to 〈v〉 is not a multiple of the regular character of 〈v〉. These results might be useful in attacking the non–coprime k(GV )–problem.
متن کاملGroup characters, permutation actions and sharpness
We extend the work which has appeared in papers on sharp characters and originated with Blichfeldt and Maillet to the Burnside ring of a finite group G. We show that the polynomial whose zeros are the set of marks of non-identity subgroups on a faithful G-set X evaluated at X is an integral multiple of the regular G-set, and deduce a result about the size of a base of X . Further consequences f...
متن کاملReconstructing finite group actions and characters from subgroup information
Holroyd, F.C., Reconstructing finite group actions and characters from subgroup information, Discrete Mathematics 110 (1992) 283-287. A finite group G is said to be action reconstructible if, for any action of G on a finite set, the numbers of orbits under restriction to each subgroup always give enough information to reconstruct the action up to equivalence. G is character reconstructible if, ...
متن کاملLinear and Nonlinear Group Actions , and The
One of the simplest and most useful notions in mathematics is that of a group action: if G is a group and X is a nonempty set, then an action of G o n X or a G-set structure on X consists of a multiplication operation G X ! X, with the image of a pair g;x written as, say, gx, with the following axioms satissed: 1 1x = x for all x 2 X here 1 2 G is the identity element o f G; 2 ghx = ghx for all...
متن کاملRational Fixed Points for Linear Group Actions
Pietro Corvaja §1 Introduction. A general principle in the theory of diophantine equations asserts that if an equation admits " many " rational solutions, there should be a geometric reason explaining such abundance. We consider here a (multiplicative) semigroup of N ×N matrices with rational entries: we suppose that all of them admit rational eigenvalues and deduce the natural geometrical cons...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Israel Journal of Mathematics
سال: 2009
ISSN: 0021-2172,1565-8511
DOI: 10.1007/s11856-009-0054-5